Facets of the (s, t)-p-path polytope
نویسنده
چکیده
We give a partial description of the (s, t)− p-path polytope of a directed graph D which is the convex hull of the incidence vectors of simple directed (s, t)-paths in D of length p. First, we point out how the (s, t) − p-path polytope is located in the family of path and cycle polyhedra. Next, we give some classes of valid inequalities which are very similar to inequalities which are valid for the p-cycle polytope, that is, the convex hull of the incidence vectors of simple cycles of length p in D. We give necessary and sufficient conditions for these inequalities to be facet defining. Furthermore, we consider a class of inequalities that has been identified to be valid for (s, t)-paths of cardinality at most p. Finally, we transfer the results to related polytopes, in particular, the undirected counterpart of the (s, t)− p-path polytope.
منابع مشابه
On the dominant of the s-t-cut polytope: Vertices, facets, and adjacency
The natural linear programming formulation of the maximum s-t-flow problem in path variables has a dual linear program whose underlying polyhedron is the dominant P↑ s-t-cut of the s-t-cut polytope. We present a complete characterization of P↑ s-t-cut with respect to vertices, facets, and adjacency.
متن کاملOn the dominant of the s-t-cut polytope
The natural linear programming formulation of the maximum s-t-flow problem in path variables has a dual linear program whose underlying polyhedron is the dominant P↑ s-t-cut of the s-t-cut polytope. We present a complete characterization of P↑ s-t-cut with respect to vertices, facets, and adjacency.
متن کاملA counterexample to the Hirsch conjecture
The Hirsch Conjecture (1957) stated that the graph of a d-dimensional polytope with n facets cannot have (combinatorial) diameter greater than n−d. That is, any two vertices of the polytope can be connected by a path of at most n− d edges. This paper presents the first counterexample to the conjecture. Our polytope has dimension 43 and 86 facets. It is obtained from a 5-dimensional polytope wit...
متن کاملLong Monotone Paths on Simple 4-polytopes
TheMonotone Upper Bound Problem (Klee, 1965) asks if the numberM(d, n) of vertices in a monotone path along edges of a d-dimensional polytope with n facets can be as large as conceivably possible: Is M(d, n) = Mubt(d, n), the maximal number of vertices that a d-polytope with n facets can have according to the Upper Bound Theorem? We show that in dimension d = 4, the answer is “yes”, despite the...
متن کاملOn finite index reflection subgroups of discrete reflection groups
Let G be a discrete group generated by reflections in hyperbolic or Euclidean space, and H ⊂ G be a finite index subgroup generated by reflections. Suppose that the fundamental chamber of G is a finite volume polytope with k facets. In this paper, we prove that the fundamental chamber of H has at least k facets. 1. Let X be hyperbolic space H, Euclidean space E or spherical space S . A polytope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Applied Mathematics
دوره 157 شماره
صفحات -
تاریخ انتشار 2009